Upper bounds for the strong chromatic index of Halin graphs
نویسندگان
چکیده
منابع مشابه
The strong chromatic index of Halin graphs
The Strong Chromatic Index of Halin Graphs By Ziyu Hu A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they have adjacent endpoints. The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin graph G is a planar graph constructed...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOn the strong chromatic index of cubic Halin graphs
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted sχ′(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin graph G is a plane graph constructed from a tree T without vertice...
متن کاملAlgorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
متن کاملOn Strong Chromatic Index of Halin Graph
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consisting of a tree with no vertex of degree tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2003